A New Construction Scheme of Convolutional Codes
نویسندگان
چکیده
A new class of (2k, k, 1) convolutional codes is proposed based on the method that creating long codes by short ones in this paper, by embedding (2k, k) double loop cyclic codes in (2, 1, 1) convolutional codes. The structural mechanism of the codes is revealed by defining a state transition matrix and using algebraic method. It is then shown that the code structure is excellent in both proportionality and diversity, so a superior code is easy to be obtained. Simulation results show that, the new convolutional codes present advantages over the traditional (2, 1, l) codes in the errorcorrecting capability and decoding speed.
منابع مشابه
New high-rate convolutional codes for concatenated schemes
This paper considers the use of the best high-rate k/(k+1) convolutional codes obtained using the new construction technique described in [1] in a concatenated scheme. Simulation results for an AWGN channel and for a realistic magnetic recording channel are reported. It is shown that these codes, endowed with a decoding algorithm working on the dual code, yield performance improvements over the...
متن کاملConvolutional Codes: Techniques of Construction
In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying these methods, several new families of convolutional codes can be constructed. As an example of code expansion, families of convolutional codes derived from clas...
متن کاملA New Construction for Low Density Parity Check Convolutional Codes
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are hence well suited for continuous transmission. In [...
متن کاملHigh Performance Steganographic Scheme Applying Time-Varying Convolutional Embedding Codes
A matrix embedding code was developed as a commonly used steganographic technique in which a parity-check matrix is used to perform embedding. However, a drawback of high decoding complexity for linear block codes by using the maximum-likelihood algorithm is unrealistic. This paper proposes a simple and effective trellis embedding scheme for binary messages. Compared with a matrix embedding alg...
متن کاملAsymptotically Good Convolutional Codes
In this paper, we construct new sequences of asymptotically good convolutional codes (AGCC). These sequences are obtained from sequences of transitive, self-orthogonal and self-dual algebraic geometry (AG) codes attaining the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the 〈u|u+ v〉 construction and the product code constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 8 شماره
صفحات -
تاریخ انتشار 2013